Dynamics and endogeny for recursive processes on trees

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Endogeny for the Logistic Recursive Distributional Equation

In this article we prove the endogeny and bivariate uniqueness property for a particular “max-type” recursive distributional equation (RDE). The RDE we consider is the so called logistic RDE, which appears in the proof of the ζ(2)-limit of the random assignment problem using the local weak convergence method proved by D. Aldous [Probab. Theory Related Fields 93 (1992)(4), 507 – 534]. This artic...

متن کامل

Bivariate Uniqueness and Endogeny for the Logistic Recursive Distributional Equation

In this article we prove the bivariate uniqueness property for a particular “max-type” recursive distributional equation (RDE). Using the general theory developed in [5] we then show that the corresponding recursive tree process (RTP) has no external randomness, more preciously, the RTP is endogenous. The RDE we consider is so called the Logistic RDE, which appears in the proof of the ζ(2)-limi...

متن کامل

Bivariate Uniqueness and Endogeny for Recursive Distributional Equations : Two Examples

In this work we prove the bivariate uniqueness property for two “maxtype” recursive distributional equations which then lead to the proof of endogeny for the associated recursive tree processes. Thus providing two concrete instances of the general theory developed by Aldous and Bandyopadhyay [3]. The first example discussed here deals with the construction of a frozen percolation process on a i...

متن کامل

Branches in random recursive k-ary trees

In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.

متن کامل

Recursive reconstruction on periodic trees

A periodic tree Tn consists of full n-level copies of a finite tree T . The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjacent vertices to have the same label is 1− . This model simulates noisy propagation of a bit from the root, and has significance both in communication theory and in biology. Our aim is to find an algorithm which decides ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastics

سال: 2006

ISSN: 1744-2508,1744-2516

DOI: 10.1080/17442500600922792